Voronoi Quantizied Crossover For Traveling Salesman Problem

It is known that the performance of a genetic algorithm depends on the survival environment and the reproducibility of building blocks. In this paper, we propose a new encoding/crossover scheme that uses genic distance which explicitly defines the distance between each pair of genes in the chromosome. It pursues both relatively high survival probabilities of more epistatic gene groups and diverse crossover operators for the high creativity of new schemata. The experimental results on benchmark traveling salesman problems showed remarkable improvement in tour cost and running time over state-of-the-art genetic algorithms for the problem.